An unbiased implementation of regularization mechanisms
نویسنده
چکیده
Perceptual processes, in computer or biological vision, require the computation of “maps” of quantitative values. The image itself is a “retinotopic map”: for each pixel of the image there is a value corresponding to the image intensity at this location. This is a vectorial value for color images. A step further, in early-vision, the retinal image contrast is computed at each location, allowing to detect image edges related to boundaries between image areas. Such maps encode not only the contrast magnitude, but several other cues: contrast orientation related to edge orientation, shape curvature, binocular disparity related to the visual depth, color cues, temporal disparity between two consecutive images in relation with visual motion detection, etc.. There are such detectors in both artificial and biological visual systems (see e.g. [12] for a general introduction and e.g. [17] for an overview about biological vision). Such maps are not only parametrized by retinotopic locations, but also using 3D locations, or other parameters.
منابع مشابه
Implementation of Sinc-Galerkin on Parabolic Inverse problem with unknown boundary condition
The determination of an unknown boundary condition, in a nonlinaer inverse diffusion problem is considered. For solving these ill-posed inverse problems, Galerkin method based on Sinc basis functions for space and time will be used. To solve the system of linear equation, a noise is imposed and Tikhonove regularization is applied. By using a sensor located at a point in the domain of $x$, say $...
متن کاملNonlinear Elastic Registration with Unbiased Regularization in Three Dimensions
We propose a new nonlinear image registration model which is based on nonlinear elastic regularization and unbiased registration. The nonlinear elastic and the unbiased regularization terms are simplified using the change of variables by introducing an unknown that approximates the Jacobian matrix of the displacement field. This reduces the minimization to involve linear differential equations....
متن کاملLocal Behavior of Sparse Analysis Regularization: Applications to Risk Estimation
In this paper, we aim at recovering an unknown signal x0 from noisy measurements y = Φx0 +w, where Φ is an ill-conditioned or singular linear operator and w accounts for some noise. To regularize such an ill-posed inverse problem, we impose an analysis sparsity prior. More precisely, the recovery is cast as a convex optimization program where the objective is the sum of a quadratic data fidelit...
متن کاملPath Space Regularization for Holistic and Robust Light Transport
We propose a simple yet powerful regularization framework for robust light transport simulation. It builds on top of existing unbiased methods and resorts to a consistent estimation using regularization only for paths which cannot be sampled in an unbiased way. To introduce as little bias as possible, we selectively regularize individual interactions along paths, and also derive the regularizat...
متن کاملTrading Variance Reduction with Unbiasedness: The Regularized Subspace Information Criterion for Robust Model Selection in Kernel Regression
A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias aga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Image Vision Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 2005